A Meta-Algorithm for the Generation of Referring Expressions
نویسندگان
چکیده
This paper describes a new approach to the generation of referring expressions. We propose to formalize a scene as a labeled directed graph and describe content selection as a subgraph construction problem. Cost functions are used to guide the search process and to give preference to some solutions over others. The resulting graph algorithm can be seen as a meta-algorithm in the sense that defining cost functions in different ways allows us to mimic — and even improve— a number of wellknown algorithms.
منابع مشابه
Collaborating on Referring Expressions
This paper presents a computational model of how conversational participants collaborate in making referring expressions. The model is based on the planning paradigm. It employs plans for constructing and recognizing referring expressions and meta-plans for constructing and recognizing clarifications. This allows the model to account for the generation and understanding both of referring expres...
متن کاملAn Efficient Meta Heuristic Algorithm to Solve Economic Load Dispatch Problems
The Economic Load Dispatch (ELD) problems in power generation systems are to reduce the fuel cost by reducing the total cost for the generation of electric power. This paper presents an efficient Modified Firefly Algorithm (MFA), for solving ELD Problem. The main objective of the problems is to minimize the total fuel cost of the generating units having quadratic cost functions subjected to lim...
متن کاملGenerating One-Anaphoric Expressions: Where Does the Decision Lie?
Most natural language generation systems embody mechanisms for choosing whether to subsequently refer to an already-introduced entity by means of a pronoun or a definite noun phrase. Relatively few systems, however, consider referring to entites by means of one-anaphoric expressions such as the small green one. This paper looks at what is involved in generating referring expressions of this typ...
متن کاملGeneration of Referring Expressions: Assessing the Incremental Algorithm
A substantial amount of recent work in natural language generation has focused on the generation of ''one-shot'' referring expressions whose only aim is to identify a target referent. Dale and Reiter's Incremental Algorithm (IA) is often thought to be the best algorithm for maximizing the similarity to referring expressions produced by people. We test this hypothesis by eliciting referring expr...
متن کاملGraphs and Spatial Relations in the Generation of Referring Expressions
When they introduced the Graph-Based Algorithm (GBA) for referring expression generation, Krahmer et al. (2003) flaunted the natural way in which it deals with relations between objects; but this feature has never been tested empirically. We fill this gap in this paper, exploring referring expression generation from the perspective of the GBA and focusing in particular on generating human-like ...
متن کامل